منابع مشابه
Counting irregular multigraphs
Gagliardi et al. (1996, unpublished manuscript) defined an irregular multigraph to be a loopless multigraph with degree sequence n, n 1 . . . . . 1, and they posed the problem of determining the number of different irregular multigraphs f , on n vertices. In Gagliardi et al. (1996) they showed that if n 0 or 3 (mod 4) then f , > n 1. In this note our aim is to show that there are constants 1 < ...
متن کاملIrregular embeddings of multigraphs with fixed chromatic number
Let G be a c-chromatic multigraph (c >t 2) with maximum edge multiplicity s. In this note we show that G has an embedding as an induced subgraph, into some degree irregular c-chromatic multigraph having the same maximum edge multiplicity.
متن کاملOn the counting function of irregular primes
It is well-known that there are infinitely many irregular primes. We prove a quantitative version of this statement, namely the number of such primes p ≤ x is at least (1 + o(1)) log log x/ log log log x as x → ∞. We show that the same conclusion holds for the irregular primes corresponding to the Euler numbers. Under some conditional results from diophantine approximation, the above lower boun...
متن کاملCounting matchings in irregular bipartite graphs and random lifts
We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland’s Lower Matching Conjecture and Schrijver’s theorem. It extends the recent work of Csikvári done for regular and bi-regular bipartite graphs. Moreover, our lower bounds are order optimal as they are attained for a sequence of 2-li...
متن کاملRemovable Circuits in Multigraphs
We prove the following conjecture of Bill Jackson ( J. London Math. Soc. (2) 21 (1980) p. 391). If G is a 2-connected multigraph with minimum degree at least 4 and containing no Petersen minor, then G contains a circuit C such that G E(C) is 2-connected. In fact, G has at least two edge-disjoint circuits which can serve as C. Until now, the conjecture had been veri ed only for planar graphs and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00190-3